Distant sum distinguishing index of graphs with bounded minimum degree
نویسندگان
چکیده
منابع مشابه
Cliques in Graphs With Bounded Minimum Degree
Let fr(n, e) be the minimum number of r-cliques in graphs of order n and size e. Determining fr(n, e) has been a long-studied problem. The case r = 3, that is, counting triangles, has been studied by various people. Erdős [3], Lovász and Simonovits [7] studied the case when e = ( n 2 ) /2 + l with 0 < l n/2. Fisher [4] considered the situation when ( n 2 ) /2 e 2 ( n 2 ) /3, but it was not unti...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملOn the Neighbor Sum Distinguishing Index of Planar Graphs
Let c be a proper edge colouring of a graph G = (V,E) with integers 1, 2, . . . , k. Then k ≥ ∆(G), while by Vizing’s theorem, no more than k = ∆(G)+ 1 is necessary for constructing such c. On the course of investigating irregularities in graphs, it has beenmoreover conjectured that only slightly larger k, i.e., k = ∆(G) + 2 enables enforcing additional strong feature of c, namely that it attri...
متن کامل2-Connected graphs with minimum general sum-connectivity index
The general sum-connectivity index of a graph G is χα(G) = ∑ uv∈E(G) (d(u)+d(v)), where d(u) denotes the degree of vertex u ∈ V (G), and α is a real number. In this paper, we show that in the class of graphs G of order n ≥ 3 and minimum degree δ(G) ≥ 2, the unique graph G having minimum χα(G) is K2 + Kn−2 if −1 ≤ α < α0 ≈ −0.867. Similarly, if we impose the supplementary condition for G to be t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ars Mathematica Contemporanea
سال: 2019
ISSN: 1855-3974,1855-3966
DOI: 10.26493/1855-3974.1496.623